Frances Foong Yao (儲楓) is professor and head of the department of computer science at the City University of Hong Kong.[1]
After receiving a B.S. in mathematics from National Taiwan University in 1969, Yao did her Ph.D. studies under the supervision of Michael J. Fischer at the Massachusetts Institute of Technology, receiving her Ph.D. in 1973. She then held positions at the University of Illinois at Urbana-Champaign, Brown University, and Stanford University, before joining the staff at the Xerox Palo Alto Research Center in 1979 where she stayed until her retirement in 1999. In 2003, she came out of retirement to take her present position at City University. She is a Fellow of the American Association for the Advancement of Science; in 1991, she and Ronald Graham won the Lester R. Ford Award of the Mathematical Association of America for their expository article, A Whirlwind Tour of Computational Geometry. Yao's husband, Andrew Yao, is also a well-known theoretical computer scientist and Turing Award winner.[2][3][4][5][6] Yao's Erdős number is 1.
Much of Yao's research has been in the subject of computational geometry and combinatorial algorithms; she is known for her work with Mike Paterson on binary space partitioning,[7] her work with Dan Greene on finite-resolution computational geometry,[8] and her work with Alan Demers and Scott Shenker on scheduling algorithms for energy-efficient power management.[9] More recently she has been working in cryptography: with her husband Andrew Yao and Wang Xiaoyun she found new attacks on the SHA-1 cryptographic hash function.[10][11]